Building Conflict-Free FFT Schedules

Constructing Conflict-Free Schedules in Space and Time

This paper addresses the problem of constructing plans and schedules for resources that must obey spatial constraints in addition to time and capacity constraints. Spatial constraints are relevant in environments that involve mobile resources whose movements must be coordinated to avoid collisions and near-misses. In air-campaign planning, for example, aircraft are allocated to missions that mu...

Constraint Programming Approach to Designing Conflict-free Schedules for Repetitive Manufacturing Processes

A problem of designing conflict-free schedules for concurrent repetitive manufacturing processes using resources in mutual exclusion is considered. Processes that share resources can wait for resources (machines) required to complete successive operations in their production routes. Systems of processes sharing only one resource are considered. A problem of finding operation times and starting ...

Building Cyclic Schedules for Emergency Department Physicians

Conflict-free Covering

Let P = {C1, C2, . . . , Cn} be a set of color classes, where each color class Ci consists of a set of points. In this paper, we address a family of covering problems, in which one is allowed to cover at most one point from each color class. We prove that the problems in this family are NP-complete (or NP-hard) and offer several constant-factor approximation algorithms.

Conflict-free Colorings

Motivated by a frequency assignment problem in cellular telephone networks, Even et al. studied the following question. Given a set P of n points in general position in the plane, what is the smallest number of colors in a coloring of the elements of P with the property that any closed disk D with D ∩ P 6= ∅ has an element whose color is not assigned to any other element of D ∩ P . We refer to ...